منابع مشابه
Combinatorial Methods in Complex Analysis
The theme of this thesis is combinatorics, complex analysis and algebraic geometry. The thesis consists of six articles divided into four parts. Part A: Spectral properties of the Schrödinger equation This part consists of Papers I-II, where we study a univariate Schrödinger equation with a complex polynomial potential. We prove that the set of polynomial potentials that admits solutions to the...
متن کاملCombinatorial Methods for Cluster Analysis
Let FX(x) be a cumulative distribution function on Ek; k-dimensional Euclidean space, k 1: We assume that FX(x) is absolutely continuous with respect to k-dimensional Lebesgue measure and denote the corresponding probability density function by fX(x): Assume that a random sample of size n has been obtained from FX(x) and denote the realizations by x1; x2; : : : ; xn: In cluster analysis, simila...
متن کاملCombinatorial methods in comparative genomics
To understand evolution, and to discover how different species are related, gene order analysis is a useful tool. Problems in this area can usually be formulated in a combinatorial language. We regard genomes as signed, circular permutations, and evolutionary operations like reversals (reversing the order of a segment of genes) and transpositions (moving a segment of genes) are easy to describe...
متن کاملIterative Methods in Combinatorial Optimization
In these lectures, I will describe a simple iterative method that supplies new proofs of integrality of linear characterizations of various basic problems in combinatorial optimization, and also allows adaptations to design approximation algorithms for NP-hard variants of these problems involving extra “degree-like” budget constraints. It is inspired by Jain’s iterative rounding method for desi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2001
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00212-0